A New Least-Squares Refinement Technique Based on the Fast Fourier Transform Algorithm
ثبت نشده
چکیده
BODE, W. & SCHWAGER, P. (1975). J. MoL Biol. 98, 693717. CHAMBERS, J. L. & STROUD, R. M. (1977). Acta Cryst. B33, 1824-1837. COOLEY, J. W. & TUKEY, J. W. (1965). Math. Comput. 19, 297-301. CRUICKSHANK, O. W. J. (1949). Acta Cryst. 2, 65-82. CUTFIELD, J. F., DODSON, E. J., DODSON, G. G., HODGKIN, D. C., ISAACS, N. W., SAKABE, K. & SAKABE, N. (1975). Acta Cryst. A31, S21. DEISENHOFER, J. & STEIGEMANN, W. (1975). Acta Cryst. B3 l, 238-250. DIAMOND, R. (1971). Acta Cryst. A27, 436-452. DIAMOND, R. (1974). J. MoI. Biol. 82, 371-391. DODSON, E. J., ISAACS, N. W. & ROLLEIq ~, J. S. (1976). Acta Cryst. A32, 311-315. DODSON, G. G., DODSON, E. J., HODGKIN, D. C. & VUAYAN, M. (1978). To be published. FREER, S. T., ALDEN, R. A., CARTER, C. W. & KRAUT, J. (1975). J. Biol. Chem. 250, 46-54. HODGKIN, D. C. (1974). Proc. R. Soc. London Ser. A, :338, 251-275. HUBER, R., KUKLA, D., BODE, W., SCHWAGER, P., BARTELS, K., DEISENHOFER, J. & STEIGEMANN, W. (1974). J. Mol. Biol. 89, 73-101. LUZZATI, V. (1952). Acta Cryst. 5, 802-810. MOEWS, P. C. & KRETSlNGER, R. H. (1975). J. Mol. Biol. 91, 201-228. SAYRE, D. (1972). Acta Cryst. A28, 210-212. SAYRE, D. (1974). Acta Cryst. A30, 180-184. TAKANO, T. (1977a). J. Mol. Biol. 110, 537-568. TAKANO, T. (1977b). J. Mol. Biol. 110, 569-584. TEN EYCK, L. F. (1973). Acta Cryst. A29, 183-191. WATENPAUGH, K. D., SIEKER, L. C., HERRIOT, J. R. & JENSEN, L. H. (1973). Acta Cryst. B29, 943-956.
منابع مشابه
Two-dimensional fast generalized Fourier interpolation of seismic records
The fast generalized Fourier transform algorithm is extended to twodimensional data cases. The algorithm provides a fast and nonredundant alternative for the simultaneous time-frequency and spacewavenumber analysis of the data with time-space dependencies. The transform decomposes the data based on the local slope information, and therefore making it possible to extract weight function based on...
متن کاملA New Technique for Image Zooming Based on the Moving Least Squares
In this paper, a new method for gray-scale image and color zooming algorithm based on their local information is offered. In the proposed method, the unknown values of the new pixels on the image are computed by Moving Least Square (MLS) approximation based on both the quadratic spline and Gaussian-type weight functions. The numerical results showed that this method is more preferable to biline...
متن کاملTwo-dimensional matched filtering for motion estimation
In this work, we describe a frequency domain technique for the estimation of multiple superimposed motions in an image sequence. The least-squares optimum approach involves the computation of the three-dimensional (3-D) Fourier transform of the sequence, followed by the detection of one or more planes in this domain with high energy concentration. We present a more efficient algorithm, based on...
متن کاملLeading Element Dichotomous Coordinate Descent Exponential Recursive Least Squares Algorithm for Multichannel Active Noise Control
In this paper, a new multichannel modified filtered-x (MFX) recursive least square (RLS) algorithm for active noise control (ANC) based on leading element dichotomous co-ordinate descent (LEDCD) iterations is proposed. It is shown that the proposed algorithm has less than half of the complexity of MFX fast transversal filter (FTF) algorithm with good performance for ideal plant models and impro...
متن کاملDesign and Simulation of an Adaptive Acoustic Echo Cancellation (AEC) for Hands-Free Communications using a Low Computational Cost Algorithm Based Circular Convolution in Frequency Domain
In this paper a module consisting of a Fast Least Mean Square (FLMS) filter is modeled and verified to eliminate acoustic echo, which is a problem for hands free communication. However the acoustic echo cancellation (AEC) is modeled using digital signal processing technique especially Simulink Blocksets. The needed algorithm code is generated in Matlab Simulink programming. At the simulation le...
متن کاملFast Algorithms for the computation of Fourier Extensions of arbitrary length
Fourier series of smooth, non-periodic functions on [−1, 1] are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say [−T,T ] with T > 1, a technique called Fourier extension or Fourier continuation. When constructed as the discrete least squares minimizer in equidistant points, the ...
متن کامل